﻿//////////////////////////////////////////////////////////////////////////////
//
// Copyright © 1998-2024 Glodon Company Limited.
//
// Licensed under the MIT License
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the “Software”),
// to deal in the Software without restriction, including without limitation
// the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
//////////////////////////////////////////////////////////////////////////////
#include "GmDeleteSelectionUtils.h"
#include "ILevel.h"
#include "LevelUtils.h"
#include "StoreyLevelComparer.h"
#include "EnableCompileWarning_The_LAST_IncludeInCpp.h"

using namespace gcmp;

void GmDeleteSelectionUtils::SortLevelElevationInDeleteSet(gcmp::IDocument * pDoc, std::vector<gcmp::ElementId>& elemIdsToDelete)
{
    DBG_WARN_AND_RETURN_VOID_UNLESS(pDoc, L"pDoc为空",L"GDMPLab",L"2024-03-30");
    std::vector<ILevel*> levelsToDelete;
    for (auto itr = elemIdsToDelete.begin(); itr != elemIdsToDelete.end(); )
    {
        ILevel *pLevel = LevelUtils::GetLevelById(pDoc, *itr);
        if (pLevel)
        {
            levelsToDelete.push_back(pLevel);
            itr = elemIdsToDelete.erase(itr);
        }
        else
        {
            ++itr;
        }
    }

    // 按标高高度值从低往高排序
    std::sort(levelsToDelete.begin(), levelsToDelete.end(), LowerLevelComparer());

    // 将标高置于待删除集合的前面
    for (auto itr = levelsToDelete.rbegin(); itr != levelsToDelete.rend(); ++itr)
    {
        elemIdsToDelete.insert(elemIdsToDelete.begin(), (*itr)->GetOwnerElement()->GetElementId());
    }
}

